ON A FAMILY OF SELF-AFFINE IFS WHOSE ATTRACTORS HAVE A NON-FRACTAL TOP

نویسندگان

چکیده

Let [Formula: see text] and text]. In this paper, we prove that for the vast majority of such parameters top planar attractor IFS is graph a continuous, strictly increasing function. Despite this, most parameters, has lower box dimension greater than 1, showing upper boundary not representative complexity fractal. Finally, if text], then non-empty interior.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Manipulation of Non-Linear IFS attractors using Genetic Programming

Non-linear Iterated Function Systems (IFSs) are very powerful mathematical objects related to fractal theory, that can be used in order to generate (or model) very irregular shapes. We investigate in this paper how Genetic Programming techniques can be efficiently exploited in order to generate randomly or interactively artistic “fractal” 2D shapes. Two applications are presented for different ...

متن کامل

Similarity dimension for IFS-attractors

Moran’s Theorem is one of the milestones in Fractal Geometry. It allows the calculation of the similarity dimension of any (strict) self-similar set lying under the open set condition. Throughout a new fractal dimension we provide in the context of fractal structures, we generalize such a classical result for attractors which are required to satisfy no separation properties.

متن کامل

IFS on the Multi-Fuzzy Fractal Space

The IFS is a scheme for describing and manipulating complex fractal attractors using simple mathematical models. More precisely, the most popular “fractal –based” algorithms for both representation and compression of computer images have involved some implementation of the method of Iterated Function Systems (IFS) on complete metric spaces. In this paper a new generalized space called Multi-Fuz...

متن کامل

Ifs Coding of High Order Non-homogeneous Fractal Images

This paper proposes a moment based encoding algorithm for iterated function system (IFS) coding of high order nonhomogeneous fractal images. The proposed algorithm employs a quasi-Newton method combined with a multi-start steepest descent technique in order to solve the simultaneous algebraic equations for IFS codes. Experimental results show that the average computational time for encoding the...

متن کامل

Fractal Compression Using Ifs Operators on Transforms

Standard fractal image compression techniques rely on using an IFS operator directly on the image function. However, sometimes it is more convenient to work on some transformed version of the image. For example, an MRI image is scanned in as frequency data. Thus, it is more natural to work on the Fourier Transform of the image rather than on the image itself. Furthermore, if your image quality ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Fractals

سال: 2021

ISSN: ['1793-6543', '0218-348X']

DOI: https://doi.org/10.1142/s0218348x21501590